Error bounds for conditional algorithms in restricted complexity set membership identification
نویسندگان
چکیده
Restricted complexity estimation is a major topic in control-oriented identi cation. Conditional algorithms are used to identify linear nite dimensional models of complex systems, the aim being to minimize the worst-case identi cation error. High computational complexity of optimal solutions suggests to employ suboptimal estimation algorithms. This paper studies di erent classes of conditional estimators, and provides results that assess the reliability level of suboptimal algorithms.
منابع مشابه
Error Bounds for Fir Models in Conditional Set-membership Identification
The present paper deals with the problem of reduced complexity model estimation in the framework of conditional set-membership identification. The measurement noise is assumed to be unknown but bounded, while the estimated model quality is evaluated according to a worst-case criterion. Since optimal conditional estimators are generally hard to compute, projection estimators are often used in vi...
متن کاملRobust Identification of Smart Foam Using Set Mem-bership Estimation in A Model Error Modeling Frame-work
The aim of this paper is robust identification of smart foam, as an electroacoustic transducer, considering unmodeled dynamics due to nonlinearities in behaviour at low frequencies and measurement noise at high frequencies as existent uncertainties. Set membership estimation combined with model error modelling technique is used where the approach is based on worst case scenario with unknown but...
متن کاملConditional central algorithms for worst case set-membership identification and filtering
This paper deals with conditional central estimators in a set membership setting. The role and importance of these algorithms in identification and filtering is illustrated by showing that problems like worst-case optimal identification and state filtering, in contexts where disturbances are described through norm bounds, are reducible to the computation of conditional central algorithms. The c...
متن کاملOn worst-case approximation of feasible system sets via orthonormal basis functions
This paper deals with the approximation of sets of linear time-invariant systems via orthonormal basis functions. This problem is relevant to conditional set membership identification, where a set of feasible systems is available from observed data, and a reduced-complexity model must be estimated. The basis of the model class is made of impulse responses of linear filters. The objective of the...
متن کاملAutomatic Bounding Estimation in Modified Nlms Algorithm
Modified Normalized Least Mean Square (MNLMS) algorithm, which is a sign form of NLMS based on set-membership (SM) theory in the class of optimal bounding ellipsoid (OBE) algorithms, requires a priori knowledge of error bounds that is unknown in most applications. In a special but popular case of measurement noise, a simple algorithm has been proposed. With some simulation examples the performa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Automat. Contr.
دوره 45 شماره
صفحات -
تاریخ انتشار 2000